Distributed Garbage Collection Algorithms
نویسنده
چکیده
This seminar report presents adoptions of uniprocessor garbage collection techniques which are able to operate in a new context: distributed systems. We see that their application to distributed system poses new problems and that there is currently no algorithm available solving, or even addressing, all of them. The presented algorithms are structured according to their belonging family: reference counting, mark-and-sweep and stopand-copy garbage collectors. Hybrid collectors that simultanously apply different techniques are also presented.
منابع مشابه
Distributed from The Derivation of Termination Detection Algorithms Garbage Collection Schemes
A b s t r a c t . It is shown that the termination detection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the termination detection problem are obtained by applying trausformations to garbage collection algorithms. The transformation can be applied to collectors of the "mark-and-sweep" type as well as to refer...
متن کاملEmpirical Studies of Distributed Garbage Collection
Garbage collection has been a necessary evil of computer languages that employ dynamic data structures. The 1990’s has seen some significant technology shifts that present new challenges for automatic garbage collection. In particular, distributed systems are providing an economical approach to parallel processing. Many distributed garbage collection algorithms have been proposed but few have b...
متن کاملPerDiS PPF Case Study: Fitting a Distributed Garbage Collection Algorithm to a Persistent Distributed Store Architecture
Several garbage collection algorithms exist, but it is not always straightforward to adapt them to a given platform. In this article, we describe our work to t a distributed garbage collection algorithm to a persistent distributed store called PerDiS. We pinpoint ordering and consistency problems, and present the way we solved them. We also address the dilemma of performance versus modularity.
متن کاملRandomized Distributed Garbage Collection
With the explosive growth of the Internet and distributed computing, disributed garbage collection (DGC) has become a very important area of research. Single-processor garbage collection is by itself one of the challenging areas of research in computer science. In distributed environments, the problem of garbage collection becomes even harder and more challenging. This is mainly due to the addi...
متن کاملA Method for Specifying and Proving Distributed Cooperative Algorithms
This paper outlines a new approach for specifying, proving, and implementing distributed cooperative algorithms associated with an object-oriented design. There are many examples of distributed algorithms that can be implemented in this way (ordered multicast, routing, spanning tree construction, election, distributed garbage collection). These algorithms present several peculiar aspects due to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006